Optimal preemptive scheduling for general target functions
نویسندگان
چکیده
منابع مشابه
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one aims at scheduling the jobs to the machines, allowing preemptions but forbidding parallelization, so that a given target function of the loads on each machine is minimized. This problem was studied in the past in the case...
متن کاملOptimal Online Preemptive Scheduling
In this lecture we’ll study online preemptive scheduling on m machines of arbitrary speeds. We’ll first review the problem and it’s associated literature, then give an optimal deterministic algorithm known as ”RatioStretch”. RatioStretch uses the optimal competitive ratio R > 1 as an input, and achieves R whenever such an R is obtainable. The exact optimal R maybe computed via a linear program,...
متن کاملProperties of optimal schedules in preemptive shop scheduling
In this work we show that certain classical preemptive shop scheduling problems with integral data satisfy the following integer preemption property: there exists an optimal preemptive schedule where all interruptions and all starting and completion times occur at integral dates. We also give new upper bounds on the minimal number of interruptions for various shop scheduling problems.
متن کاملNear-Optimal Fixed Priority Preemptive Scheduling of Offset Free Systems
In this paper, we study the problem of the fixed priority preemptive scheduling of hard real-time tasks. We consider independent tasks, which are characterized by a period, a hard deadline, a computation time, and an offset (the time at which the first request is issued) where the latter can be chosen by the scheduling algorithm. Considering only the synchronous case is very pessimistic for off...
متن کاملOptimal preemptive scheduling on uniform machines with discounted flowtime objectives
We consider the problem of scheduling n jobs on m parallel machines. Each job has a deterministic processing time and a weight associated with it. For uniform machines we show that discounted flowtime is minimized by serving jobs preemptively in increasing order of their remaining processing times, assigning the job with the shortest remaining processing time to the fastest available machine. 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2006
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2005.08.002